搜索资源列表
knight
- 2、 写出6×6方阵的骑士周游的解。要求骑士的起跳位置是任意指定的。编制非递归程序,求出马的行走路线,并按求出的行走路线,将数字依次填入6×6的方阵中,并输出。 (骑士周游:从起始位置出发,按国际象棋马的走法,不重复地将所有区域恰好走一遍。) -2, write a 6 × 6 square Cavalier travel solution. Requirements of the take-off position Cavalier arbitrary specified. The p
123
- 数据结构课程中,采用非递归算法 ,利用栈中序遍历二叉树。-Data structure course, the use of non-recursive algorithm using binary tree traversal stack.
SeedFill
- 计算机图形学作业。种子填充算法。非递归和递归两种。效率不错。-Computer graphics operation. Seed fill algorithm. Two non-recursive and recursive. Good efficiency.
mgqj
- 可以输入一个任意大小的迷宫数据,用非递归的方法求出一条走出迷宫的路径,并将路径输出; 要求: 在上交资料中请写明:存储结构、基本算法(可以使用程序流程图)、源程序、测试数据和结果、算法的时间复杂度、另外可以提出算法的改进方法; -Can enter a maze of any size data, with non-recursive method to derive a path out of the maze, and the path output requirements
suanfa
- 数据结构三种先序遍历非递归算法。 数据结构三种先序遍历非递归算法。-Data structure of three first traversal non-recursive algorithm. Data structure of three first traversal non-recursive algorithm.
DS_5060309818_RBTree
- 红黑树的C++实现,(上海交通大学联读班数据结构大作业1),实现了应有功能:插入,删除,查找,求树高,非递归中序遍历,以及VC界面下的Tree_View()。-Red and black tree C++ Achieve, (Shanghai Jiaotong University Joint Reading class data structure operation 1), the realization of the proper functions: insert, delete, fi
subset
- 求一个集合的子集的非递归解法,模拟的栈的进出。-For a subset of a collection of non-recursive method to simulate the stack and out.
Bitree
- 二叉树三种遍历的非递归算法(背诵版) 本贴给出二叉树先序、中序、后序三种遍历的非递归算法,此三个算法可视为标准算法,直接用于考研答题。 -Binary Tree Traversal three non-recursive algorithm (recitation version) gives the paste bintree first order, in sequence, after the sequence of three non-recursive traversal al
DFS
- DFS算法的非递归函数 老师布置的,满分作业哦!-DFS algorithm of non-recursive function teacher layout, operating out of Oh!
BST_path
- 二叉搜索树求每个结点到根节点的路径 非递归的先序,中序,后序遍历-Binary search tree for each node to the root path of the first non-recursive sequence, in order, after the traversal
2
- 用邻接表表示的图的深度优先周游的非递归算法,邻接表的构造算法-Adjacency list with the plan said the depth-first tour of the non-recursive algorithm, adjacency list structure algorithm
shujujiegou
- 本课题主要根据功能需要开发软件解决迷宫求解的问题。可以输入一个任 意大小的迷宫数据,用非递归的方法求出一条走出迷宫的路径,并将路径输出。以及Joseph环问题,利用单向循环链表存储结构模拟此,按照出列的顺序输出各个人的编号。还有猴子选大王问题。数据结构课程设计时做的-This issue primarily on the basis of functional need to develop software solutions to solve maze problems. Can enter
_Queen
- 非递归实现N皇后问题求解,输出全部求解的集合。-Non-recursive realization of N Queen s problem solving, solving a collection of all output.
1079113201
- 任务:可以输入一个任意大小的迷宫数据,用非递归的方法求出一条走出迷宫的路径,并将路径输出; 要求: 在上交资料中请写明:存储结构、基本算法(可以使用程序流程图)、源程序、测试数据和结果、算法的时间复杂度、另外可以提出算法的改进方法; -Task: You can enter a maze of any size data, with non-recursive method to derive a path out of the maze, and the path output
eightquee
- 非递归八皇后问题,c语言源码实现八皇后问题-Queen
house
- 马踏棋盘问题描述设计一个国际象棋的马踏遍棋盘的演示程序。2. 基本要求将马随机放在国际象棋8*8棋盘的某个方格中,马按走棋规则进行移动。编制非递归程序,求出马的行走路线,-Horse riding problem described in the design of a chessboard chess chessboard horse traveled demo program. 2. The basic requirements will be placed randomly MA 8* 8
DosAvl
- 这是一个数据结构的小程序,非递归的avl树实现,用到了穿线法-This is a data structure of small procedures, non-recursive AVL tree realization, using the threading method
binary_tree
- 二叉树三种遍历的非递归算法 给出二叉树先序、中序、后序三种遍历的非递归算法,此三个算法可视为标准算法,直接用于考研答题。-Binary Tree Traversal three non-recursive algorithm
eight_queen
- 八皇后问题,老归老,但试图用各种方法来实现求解,出乎意料的是,同样的算法,非递归实现的速度竟然比递归实现慢!-Eight queen problem, the old to the old, but trying to use various methods to achieve Solving Surprisingly, the same algorithm, the speed of non-recursive implementation was slower than the recur
traverse
- 后续遍历非递归 数据结构中二叉树的遍历中 使用后续遍历非递归遍历二叉树-Follow-up data structure traversal non-recursive traversal of binary tree used in the follow-up traversal non-recursive binary tree traversal